An $L^1$ Penalty Method for General Obstacle Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An L1 Penalty Method for General Obstacle Problems

We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for a large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical ellip...

متن کامل

A Penalty Method for Some Nonlinear Variational Obstacle Problems∗

We formulate a penalty method for the obstacle problem associated with a nonlinear variational principle. It is proven that the solution to the relaxed variational problem (in both the continuous and discrete settings) is exact for finite parameter values above some calculable quantity. To solve the relaxed variational problem, an accelerated forward-backward method is used, which ensures conve...

متن کامل

Obstacle avoidance for an autonomous vehicle using force field method

This paper presents a force field concept for guiding a vehicle at a high speed maneuver. This method is  similar to potential field method. In this paper, motion constrains like vehicles velocity, distance to obstacle and tire conditions and such lane change conditions as zero slop condition and zero lateral acceleration are discussed. After that, possible equations as vehicles path ar...

متن کامل

Pointwise a Posteriori Error Analysis for an Adaptive Penalty Finite Element Method for the Obstacle Problem

Finite element approximations based on a penalty formulation of the elliptic obstacle problem are analyzed in the maximum norm. A posteriori error estimates, which involve a residual of the approximation and a spatially variable penalty parameter, are derived in the cases of both smooth and rough obstacles. An adaptive algorithm is suggested and implemented in one dimension.

متن کامل

Consistent clustering using an l1 fusion penalty

Here we provide three lemmas that make important contributions to the proof of the theorem. The first allows us to focus on a compact support, the second established uniform convergence of the sample criterion functions on compact sets, and the third derives useful continuity properties of the population solution. The proofs of the lemmas are provided below, after the main argument for Theorem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Applied Mathematics

سال: 2015

ISSN: 0036-1399,1095-712X

DOI: 10.1137/140963303